The home marking problem and some related concepts
نویسندگان
چکیده
In this paper we study the home marking problem for Petri nets, and some related concepts to it like confluence, noetherianity, and state space inclusion. We show that the home marking problem for inhibitor Petri nets is undecidable. We relate then the existence of home markings to confluence and noetherianity and prove that confluent and noetherian Petri nets have an unique home marking. Finally, we define some versions of the state space inclusion problem related to the home marking and sub-marking problems, and discuss their decidability status.
منابع مشابه
The Role of House Outdoor Environment Features in Creating Home Attachment
Home attachment is positive emotional bond between home and its dwellers which may result in safety, solace and tranquility for them. To create this kind of relationship some physical and social prerequisites need to exist inside home. This article aims to answer the question "whether house outdoor environment features are also effective in developing home attachment or not?" Aiming to answer t...
متن کاملEnhancing Skid Resistance of Two-Component Road Marking Paint using Mineral and Recycled Materials
Low skid resistance of road marking paint is one of the major issues in the safety of vehicle drivers, cyclists, and pedestrians when traveling on the city streets. Among the variety of marking paint, two-component paint is widely used at intersections and roundabouts. Therefore, the paint used should have adequate skid resistance. The object of this study was to evaluat...
متن کاملCooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملExistence of home states in Petri nets is decidable
We show that the problem whether a given Petri net has a home state (a marking reachable from every reachable marking) is decidable, and at least as hard as the reachability problem.
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 15 شماره
صفحات -
تاریخ انتشار 2002